Gossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs

This paper continues with the study of the communication modes introduced in, University of Paderborn. (Extended abstract presented at WG'93.)] as a generalization of the standard one-way and two-way modes allowing to send messages between processors of interconnection networks via vertex-disjoint paths in one communication step. The complexity of communication algorithms is measured by the number of communication steps (rounds). Here, the complexity of gossiping in grids and in planar graphs is investigated. The main results are the following: 1. EEective one-way and two-way gossip algorithms for d-dimensional grids, d 2, are designed. 2. The lower bound 2 log 2 n ? log 2 k ? log 2 log 2 n ? 4 is established on the number of rounds of every two-way gossip algorithm working on any graph of n nodes and vertex bisection k. This proves that the designed two-way gossip algorithms on d-dimensional grids, d 3, are almost optimal, and it also shows that the 2-dimensional grid belongs to the best gossip graphs among all planar graphs. 3. Another lower bound proof is developed to get some tight lower bounds on one-way \well-structured" gossip algorithms on planar graphs (to the best of the authors' knowledge, to date all gossip algorithms designed in vertex-disjoint paths mode have been \well-structured"). An extended abstract of this paper was presented at the 1st European Symposium on Algorithms (ESA'93).